Scheduling in polling systems
نویسندگان
چکیده
We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling systems. It illustrates that a large class of scheduling policies behaves similarly in the exhaustive polling model and the standard M/GI/1 model, whereas scheduling policies in the gated polling model behave very differently than in an M/GI/1.
منابع مشابه
Response-time Approximations for Multi-server, Multi-class Production Systems with Significant Setups
A multi-server polling model is a queueing model where many order classes share a set of identical servers and a setup time is incurred whenever a server changes class. This paper develops approximations for the waiting time distribution in a multi-server polling model with cyclic serve-to-exhaustion service. These approximations are derived using previously established heavy-traac results and ...
متن کاملPerformance Evaluation of Polling-Based Communication Systems Using SPNs
In this paper we present stochastic Petri nets (SPNs) that can be used for the evaluation of polling mechanisms. Polling mechanisms (or systems) appear in many forms in computer-communication systems: the well-known token-ring and token-bus network access schemes such as present in IEEE P802.4/5 and in FDDI, and the scheduling mechanisms in switching fabrics, e.g., for ATM systems, operate alon...
متن کاملMulticycle Polling Scheduling Algorithm
The paper deals with the scheduling of periodic information flow in FieldBus environment. The scheduling problem is defined from an analytical point of view, giving a brief survey of the most well-known solutions, and illustrating multicycle polling scheduling which is based on the hypothesis that all the production period of the periodic processes to be scheduled are harmonic. Although in some...
متن کاملImproving Scalability of Task Allocation and Scheduling in Large Distributed Real-Time Systems Using Shared Buffers
Scheduling precedence-constrained tasks in a distributed real-time system is an NP-hard problem. As a result, the task allocation and scheduling algorithms that use these heuristics do not scale when applied to large distributed systems. In this paper, we propose a novel approach that eliminates inter-task dependencies using shared buffers between dependent tasks. The system correctness, with r...
متن کاملJoint Polling and Contention Based Feedback Algorithm to Exploit Multiuser Diversity
One of the most promising approaches to boost the communication efficiency in wireless systems is the use of multiuser diversity (MUDiv), where the fading of channels is exploited. The mechanism of scheduling the user with the best channel condition is called opportunistic scheduling (OS). In this paper we propose a joint polling and contention based feedback (JPCF) algorithm that exploits MUDi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Perform. Eval.
دوره 64 شماره
صفحات -
تاریخ انتشار 2007